Matching through position auctions
نویسنده
چکیده
This paper uses a mechanism design framework to characterize how an intermediary can design profit-maximizing matching markets when agents have private information about their quality. When match surpluses are supermodular, sufficient conditions are provided that ensure positive assortative matching is profit maximizing. Under these conditions, two-sided position auctions are characterized that can implement the optimal match and payments, but increasing, pure-strategy equilibria can fail to exist if agents only pay when they receive a partner. Restrictions on the matchmaker’s ability to price discriminate are shown to increase inefficiency and potentially shift the burden of price discrimination onto a single side. JEL Classification Codes: D44, C78, D85
منابع مشابه
A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملTractable Computational Methods for Finding Nash Equilibria of Perfect-Information Position Auctions
Due to the economic importance of the position auctions used by search engines to sell advertising, these auctions have received considerable recent study. However, most of this study has been analytic, and these analyses have relied on strong assumptions about the structure of the setting. In this paper, we show that it is feasible to perform computational equilibrium analyses of complex, real...
متن کاملUser modeling in position auctions: re-considering the GSP and VCG mechanisms
We introduce a study of position auctions, with an explicit modeling of user navigation through ads. We refer to our model as the PPA model, since it is most applicable in the context of pay-per-action position auctions. In this model, which is consistent with other recent approaches to user modeling, a typical user searches sequentially over the ordered list of ads. At each point the user has ...
متن کاملMaximizing matching in double-sided auctions
Traditionally in double auctions, offers are cleared at the equilibrium price. In this paper, we introduce a novel, non-recursive, matching algorithm for double auctions, which aims to maximize the amount of commodities to be traded. Our algorithm has lower time and space complexities than existing algorithms.
متن کاملTractable Combinatorial Auctions Via Graph Matching
Combinatorial auctions play a key role in distributed AI as a mechanism for efficiently allocating resources or tasks, both for cooperative and competitive scenarios. The complexity of the general problem has lead to interest in finding efficient algorithms for useful instances. Tennenholtz introduced an approach which finds polynomial solutions for certain classes of combinatorial auctions by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Economic Theory
دوره 148 شماره
صفحات -
تاریخ انتشار 2013